A minor-monotone graph parameter based on oriented matroids

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monotone Paths on Zonotopes and Oriented Matroids

Monotone paths on zonotopes and the natural generalization to maximal chains in the poset of topes of an oriented matroid or arrangement of pseudo-hyperplanes are studied with respect to a kind of local move, called polygon move or ip. It is proved that any monotone path on a d-dimensional zonotope with n generators admits at least d2n=(n ? d + 2)e ? 1 ips for all n d+2 4 and that for any xed v...

متن کامل

A graph-theoretical axiomatization of oriented matroids

We characterize which systems of sign vectors are the cocircuits of an oriented matroid in terms of the cocircuit graph.

متن کامل

Interval Routing and Minor-Monotone Graph Parameters

We survey a number of minor-monotone graph parameters and their relationship to the complexity of routing on graphs. In particular we compare the interval routing parameters κslir(G) and κsir(G) with Colin de Verdière’s graph invariant μ(G) and its variants λ(G) and κ(G). We show that for all the known characterizations of θ(G) with θ(G) being μ(G), λ(G) or κ(G), that θ(G) ≤ 2κslir(G) − 1 and θ...

متن کامل

On the Relation Between Two Minor-Monotone Graph Parameters

We prove that for each graph (G) (G) + 2, where and are minor-monotone graph invariants introduced by Colin de Verdi ere 3] and van der Holst, Laurent and Schrijver 5]. It is also shown that a graph G exists with (G) < (G). The graphs G with maximal planar complement and (G) = jV (G)j ? 4, characterised by Kotlov, Lovv asz and Vempala, are shown to be forbidden minors for fH j (H) < jV (G)j ? 4g.

متن کامل

Oriented matroids and complete-graph embeddings on surfaces

We provide a link between topological graph theory and pseudoline arrangements from the theory of oriented matroids. We investigate and generalize a function f that assigns to each simple pseudoline arrangement with an even number of elements a pair of complete-graph embeddings on a surface. Each element of the pair keeps the information of the oriented matroid we started with. We call a simple...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1997

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(96)00172-0